Extremal double hexagonal chains with respect to k-matchings and k-independent sets

نویسندگان

  • Haizhen Ren
  • Fuji Zhang
چکیده

Double hexagonal chains” can be considered as benzenoids constructed by successive fusions of successive naphthalenes along a zig-zag sequence of triples of edges as appear on opposite sides of each naphthalene unit. In this paper, we discuss the numbers of k-matchings and k-independent sets of double hexagonal chains, as well as Hosoya indices and Merrifield–Simmons indices, and obtain some extremal results: among all the double hexagonal chains with the same number of naphthalene units, (a) the double linear hexagonal chain hasminimal k-matching number andmaximal k-independent set number and (b) the double zig-zag hexagonal chain has maximal k-matching number and minimal k-independent set number, which are extensions to hexagonal chains [L. Zhang and F. Zhang, Extremal hexagonal chains concerning k-matchings and k-independent sets, J. Math. Chem. 27 (2000) 319–329]. © 2007 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremal k∗-Cycle Resonant Hexagonal Chains

Denote by B∗ n the set of all k∗-cycle resonant hexagonal chains with n hexagons. For any Bn ∈ B ∗ n , let m(Bn) and i(Bn) be the numbers of matchings (=the Hosoya index) and the number of independent sets (=the Merrifield-Simmons index) of Bn, respectively. In this paper, we give a characterization of the k∗-cycle resonant hexagonal chains, and show that for any Bn ∈ B ∗ n , m(Hn) ≤ m(Bn) and ...

متن کامل

Global Forcing Number for Maximal Matchings under Graph Operations

Let $S= \{e_1,\,e_2‎, ‎\ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$‎. ‎The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the‎ ‎vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$‎, ‎where $d_i=1$ if $e_i\in M$ and $d_i=0$‎ ‎otherwise‎, ‎for each $i\in\{1,\ldots‎ , ‎k\}$‎. ‎We say $S$ is a global forcing set for maximal matchings of $G$‎ ‎if $...

متن کامل

The Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl Hexagonal Chains

As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph $G$ are defined as $J(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)D_{G}(v)}}$ and $SJ(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)+D_{G}(v)}}$, respectively, where $D_{G}(u)=sumlimits_{vin V}d(u,v)$ is the distance sum of vertex $u$ in $G$, $m$ is the n...

متن کامل

Chain hexagonal cacti: extremal with respect to the eccentric connectivity index

In this paper we present explicit formulas for the eccentric connectivity index of three classes of chain hexagonal cacti. Further, it is shown that the extremal chain hexagonal cacti with respect to the eccentric connectivity index belong to one of the considered types. Some open problems and possible directions of further research are mentioned in the concluding section.

متن کامل

The number of maximal matchings in polyphenylene chains

A matching is maximal if no other matching contains it as a proper subset. Maximal matchings model phenomena across many disciplines, including applications within chemistry. In this paper, we study maximal matchings in an important class of chemical compounds: polyphenylenes. In particular, we determine the extremal polyphenylene chains in regards to the number of maximal matchings. We also de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 155  شماره 

صفحات  -

تاریخ انتشار 2007